Description: 98年全国大学生数学建模竞赛B题“水灾巡视问题”，是一个推销员问题，本题有53个点，所有可能性大约为exp(53),目前没有好方法求出精确解，既然求不出精确解，我们使用模拟退火法求出一个较优解,将所有结点编号为1到53,1到53的排列就是系统的结构,结构的变化规则是:从1到53的排列中随机选取一个子排列,将其反转或将其移至另一处,能量E自然是路径总长度。具体算法描述如下：步1： 设定初始温度T，给定一个初始的巡视路线。步2 ：步3 --8循环K次步3：步 4--7循环M次步4：随机选择路线的一段步5：随机确定将选定的路线反转或移动，即两种调整方式：反转、移动。步6：计算代价D，即调整前后的总路程的长度之差步7：按照如下规则确定是否做调整：如果D<0,则调整如果D>0,则按照EXP(-D/T)的概率进行调整步8:T*0.9-->T,降温-98 National Mathematical Contest in Modeling B and that the "flood inspections", is a salesman problem, and that is 53 points, all possibilities about exp (53), there is no good way to get accurate solutions, since no exact solution for, we used simulated annealing France obtained an optimum solution to all nodes to a number of 53 to 53.1 is with the system structure, changes in the structure of the rules is : from 1-53 with a randomly selected with a son, to reverse or to move it to another, the energy E is the natural path length. The specific algorithm is described as follows : Step 1 : The initial set temperature T, given an initial inspection line. Step 2 : Step 3-- 8 K cycle times Step 3 : Step 4-- 7 M cycle times Step 4 : The random selection of routes for Step 5 : rando Platform: |
Size: 2048 |
Author:王冠 |
Hits:
Description: 用模拟退火技术解决旅行商问题.算法中采用了人工智能中比较新的模拟退火算法.-simulated annealing technology to solve the traveling salesman problem. Algorithms used in the artificial intelligence relatively new simulated annealing algorithm. Platform: |
Size: 101376 |
Author:刘先生 |
Hits:
Description: 用模拟退火算法求解旅行商问题，其中用STL中的Vector来实现路径的存放 -simulated annealing algorithm for the traveling salesman problem, which use the STL Vector to achieve the storage path Platform: |
Size: 117760 |
Author:田园 |
Hits:
Description: 是一个模拟退火程序,解决的是货郎担问题,所用的语言是matlab
-is a simulated annealing procedures to solve the traveling salesman problem is that the language used is Matlab Platform: |
Size: 5120 |
Author:成应 |
Hits:
Description: 这是一个SA求解tsp旅行商的matlab源代码，由m文件构成，可方便大家学习模拟退火算法。-This is a traveling salesman tsp SA for the Matlab source code, document constitute m, can facilitate learning simulated annealing. Platform: |
Size: 6144 |
Author:郑立刚 |
Hits:
Description: 在MPI平台下，用C语言实现模拟退火算法的货郎担问题的并行算法。-In the MPI platform, using C language to achieve simulated annealing algorithm traveling salesman problem of the parallel algorithm. Platform: |
Size: 8192 |
Author:俊峰 |
Hits:
Description: 用模拟退火算法求解旅行商问题
T(t+1)＝k×T(t)
式中k为正的略小于1.00的常数，t为降温的次数 -Using Simulated Annealing Algorithm for Solving Traveling Salesman Problem T (t+ 1) = k × T (t) where k is slightly less than 1.00 are constants, t is the number of cooling Platform: |
Size: 2048 |
Author:清水 |
Hits:
Description: 模拟退火算法应用，有图像着色问题，独立集，最大截，旅行商等问题。-Application of simulated annealing algorithm, has the image coloring problem, independent set, maximum cut-off, traveling salesman and so on. Platform: |
Size: 17408 |
Author:蓝裳 |
Hits:
Description: 本文以著名的旅行商问题(TSP)为例说明如何利用MATLAB语言实现模拟退火算法。-In this paper, the well-known traveling salesman problem (TSP) as an example on how to use MATLAB language to achieve simulated annealing algorithm. Platform: |
Size: 40960 |
Author:宋彦斌 |
Hits:
Description: 平台vs2005
模拟固体退火算法实现144个城市的旅行商问题，可设置具体参数-VS2005 simulation platform to achieve solid annealing algorithm 144 city traveling salesman problem, you can set specific parameters Platform: |
Size: 12536832 |
Author:庄雄雄 |
Hits:
Search - salesman annealing